منابع مشابه
A new optimal method of fourth-order convergence for solving nonlinear equations
In this paper, we present a fourth order method for computing simple roots of nonlinear equations by using suitable Taylor and weight function approximation. The method is based on Weerakoon-Fernando method [S. Weerakoon, G.I. Fernando, A variant of Newton's method with third-order convergence, Appl. Math. Lett. 17 (2000) 87-93]. The method is optimal, as it needs three evaluations per iterate,...
متن کاملFourth-order finite difference method for solving Burgers' equation
In this paper, we present fourth-order finite difference method for solving nonlinear one-dimensional Burgers equation. This method is unconditionally stable. The convergence analysis of the present method is studied and an upper bound for the error is derived. Numerical comparisons are made with most of the existing numerical methods for solving this equation. 2005 Elsevier Inc. All rights res...
متن کاملCubic splines method for solving fourth-order obstacle problems
In this paper, we develop a new cubic spline method for computing approximate solution of a system of fourth-order boundary value problems associated with obstacle, unilateral and contact problems. It is shown that the present method is of order two and gives approximations which are better than those produced by some other collocation, finite difference and spline methods. Numerical examples a...
متن کاملa new optimal method of fourth-order convergence for solving nonlinear equations
in this paper, we present a fourth order method for computing simple roots of nonlinear equations by using suitable taylor and weight function approximation. the method is based on weerakoon-fernando method [s. weerakoon, g.i. fernando, a variant of newton's method with third-order convergence, appl. math. lett. 17 (2000) 87-93]. the method is optimal, as it needs three evaluations per ite...
متن کاملFourth order and fourth sum connectivity indices of tetrathiafulvalene dendrimers
The m-order connectivity index (G) m of a graph G is 1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i m d d d G where 1 2 1 ... i i im d d d runs over all paths of length m in G and i d denotes the degree of vertex i v . Also, 1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i ms d d d X G is its m-sum connectivity index. A dendrimer is an artificially manufactured or synth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2018
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/995/1/012008